Neighborhood-Based Information Costs
نویسندگان
چکیده
We derive a new cost of information in rational inattention problems, the neighborhood-based functions, starting from observation that many settings involve exogenous states with topological structure. These functions are uniformly posterior separable and capture notions perceptual distance. This second property ensures costs, unlike mutual information, make accurate predictions about behavior experiments. compare implications our those series applications: judgments, general environment binary choice, regime-change games, linear-quadratic-Gaussian settings. (JEL C70, D11, D82, D83, D91)
منابع مشابه
Image segmentation based on fuzzy clustering with neighborhood information
In this paper, an improved fuzzy c-means (IFCM) clustering algorithm for image segmentation is presented. The originality of this algorithm is based on the fact that the conventional FCM-based algorithm considers no spatial context information, which makes it sensitive to noise. The new algorithm is formulated by incorporating the spatial neighborhood information into the original FCM algorithm...
متن کاملUltra Smart Counter Based Broadcast Using Neighborhood Information in MANETS
Broadcasting protocol heavily affects performance of Mobile Ad Hoc Networks (MANET). Counter-based scheme can reduce the number of rebroadcasts, and as a result reduce Broadcast Storm Problem. Previously fixed counter-based broadcasting was used irrespective of node/network status; this research demonstrates that dynamically adjusting the counter-based to take into account neighborhood informat...
متن کاملPavement Image Segmentation Based on FCM Algorithm Using Neighborhood Information
Standard FCM algorithm takes the pixel gray-scale information into account only, while ignoring the spatial location of pixels, so the standard FCM algorithm is sensitive to noise. This paper present a pavement image segmentation algorithm based on FCM algorithm using neighborhood information. The presented algorithm introduces neighborhood information into membership function to improve the st...
متن کاملA robust training algorithm based on neighborhood information
Robustness is an important issue in automatic speech recognition systems. When the testing conditions do not match the training condition or when there is insufficient training data, the performance of a system trained by maximum likelihood criterion may degrade significantly. Different robust algorithms were proposed especially for cases in which the mismatch condition is known or can be estim...
متن کاملSpectral Clustering with Neighborhood Attribute Reduction Based on Information Entropy
Traditional rough set theory is only suitable for dealing with discrete variables and need data preprocessing. Neighborhood rough sets overcome these shortcomings with the ability to directly process numeric data. This paper modifies the attribute reduction method based on neighborhood rough sets, in which the attribute importance is combined with information entropy to select the appropriate a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The American Economic Review
سال: 2021
ISSN: ['2640-205X', '2640-2068']
DOI: https://doi.org/10.1257/aer.20200154